New results on the completion time variance minimization
نویسندگان
چکیده
منابع مشابه
New Results on the Completion Time Variance Minimization
A single machine scheduling problem where the objective is to minimize the variance of job completion times is considered. The model is applicable to many environments where it is desirable to provide jobs, customers or computer files, with approximately the same service. It is shown that the problem can be formulated as a problem of maximizing a zeroone quadratic function which is a submodular...
متن کاملNew Results on Quadratic Minimization
In this paper we present several new results on minimizing an indefinite quadratic function under quadratic/linear constraints. The emphasis is placed on the case where the constraints are two quadratic inequalities. This formulation is termed the extended trust region subproblem in this paper, to distinguish it from the ordinary trust region subproblem where the constraint is a single ellipsoi...
متن کاملMinimizing Class-Based Completion Time Variance on a single machine
⎯We consider the problem of scheduling a set of simultaneously available jobs on a single machine. The objective is to determine a schedule that minimizes the class-based completion time variance (CB-CTV) of the jobs while reducing the overall CTV is taken as the secondary objective. This non-regular performance measure is closely related to service stability and of practical significance in ma...
متن کاملNew Results on Online Resource Minimization
We consider the online resource minimization problem in which jobs with hard deadlines arrive online over time at their release dates. The task is to determine a feasible schedule on a minimum number of machines. We rigorously study this problem and derive various algorithms with small constant competitive ratios for interesting restricted problem variants. As the most important special case, w...
متن کاملA Lower Bound for the Weighted Completion Time Variance Problem
We consider a single machine scheduling problem to minimize the weighted completion time variance. This problem is known to be NP-hard in the strong sense. We propose a lower bound based on splitting of jobs and the Viswanathkumar and Srinivasan procedure and a heuristic. The test on more than 2000 instances shows that this lower bound is very tight.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1995
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)e0125-i